Free, publicly-accessible full text available February 1, 2025
Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher.
Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?
Some links on this page may take you to non-federal websites. Their policies may differ from this site.
-
-
Free, publicly-accessible full text available June 25, 2024
-
Free, publicly-accessible full text available June 25, 2024
-
We consider the secure computation problem in a minimal model, where Alice and Bob each holds an input and wish to securely compute a function of their inputs at Carol without revealing any additional information about the inputs. For this minimal secure computation problem, we propose a novel coding scheme built from two steps. First, the function to be computed is expanded such that it can be recovered while additional information might be leaked. Second, a randomization step is applied to the expanded function such that the leaked information is protected. We implement this expand-and-randomize coding scheme with two algebraic structures—the finite field and the modulo ring of integers, where the expansion step is realized with the addition operation and the randomization step is realized with the multiplication operation over the respective algebraic structures.more » « less
-
more » « less
Abstract A highly practical and step‐economic α,β‐dehydrogenation of carboxylic acids via enediolates is reported through the use of allyl‐palladium catalysis. Dianions underwent smooth dehydrogenation when generated using Zn(TMP)2⋅2 LiCl as a base in the presence of excess ZnCl2, thus avoiding the typical decarboxylation pathway of these substrates. Direct access to 2‐enoic acids allows derivatization by numerous approaches.
